a vehicle routing problem with minimizing fuel consumption and number of vehicles by improved particle swarm optimization
نویسندگان
چکیده
in recent years, reducing emissions has become an important issue. besides reducing the economic costs, reducing the fuel consumption decreases emissions, pollutant impact and increases society health as well. green vehicle routing problem are a major key to reduce hazardous effects of transportation such as air pollution, greenhouse gas (ghg) emissions, noise and the like. generally, the amount of pollution emitted by a vehicle over an arc depends on many factors like vehicle load, travel speed, travel distance, road slop and etc. vehicle load has a major effect among other factors on amount of emissions and influences the route selection. some works were completed on the estimation of the cost of the ghg emissions. therefore, the effect of the carried load in fuel consumption is contributed in the model by minimizing a weighted load function. this paper presents a new method for vehicle routing problem with minimizing fuel consumption and number of vehicles. distributing managers are often interested in minimizing fuel consumption caused by two reasons: 1) reducing fuel consumption caused to reduce the service cost, economic costs and increasing customer’s satisfaction, and 2) reducing fuel consumption is a way for reducing pollutant negative impact on our environment and increasing society health. also, minimizing the number of vehicles is caused the reducing in fixed and other related cost. it is proven that vrps belong to the category of np-hard problems thus due to the complexity of vrp with exact methods in large-scale problems, a meta-heuristic method based on particle swarm optimization is proposed, so called improved particle swarm optimization (ipso). in addition, to show the efficiency of the proposed ipso, a number of test problems in small and large sizes are proposed and solved by the ipso. then, the obtained results are evaluated with the results obtained by lingo.
منابع مشابه
A particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملAn Improved Particle Swarm Optimization for Vehicle Routing Problem
Vehicle routing problem is a NP-hard problem in combination optimization problem, It is influenced by many factors, and the process is complex. However, the search space of particle swarm algorithm is limited and prone to precocious phenomenon. In this paper, we based on the original particle swarm optimization, present a new way of location update algorithm (VPSO).VPSO in the process of solvin...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملa particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
in this article, multiple-product pvrp with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. a mathematical formulation was provided for this problem. each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. to solve the problem, two meta-heuristic methods...
متن کاملImproved Particle Swarm Algorithm to Solve the Vehicle Routing Problem
Vehicle routing problem is a NP hard problem. To solve the premature convergence problem of the particle swarm optimization, an improved particle swarm optimization method was proposed. In the first place, introducing the neighborhood topology, defining two new concepts lepton and hadron. Lepton are particles within the scope of neighborhood, which have weak interaction between each other, so t...
متن کاملParticle Swarm Optimization for Open Vehicle Routing Problem
Open Vehicle Routing Problem with Time Dependent Travel Time (OVRPTD) is different from most variants of vehilce routing problems from the liteture in that the vehicle dosen’t return to the depot after serving the last customer and the travle time is time dependent. The travle time is presented by a continuous dynamic network time dependent function. Particle Swarm Optimization with self-adapti...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مهندسی صنایعجلد ۴۷، شماره ۱، صفحات ۱۰۵-۱۱۲
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023